The Largest Hole in Sparse Random Graphs
نویسندگان
چکیده
We show that for \(d\ge d_0({\epsilon })\), with high probability, the size of a largest induced cycle in random graph G(n, d/n) is \((2\pm {\epsilon })\frac{n}{d}\log d\). This settles long-standing open problem theory.
منابع مشابه
The Largest Eigenvalue Of Sparse Random Graphs
We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n, p) satisfies almost surely: λ1(G) = (1 + o(1))max{ √ ∆, np}, where ∆ is a maximal degree of G, and the o(1) term tends to zero as max{ √ ∆, np} tends to infinity.
متن کاملLargest sparse subgraphs of random graphs
For the Erdős-Rényi random graph Gn,p, we give a precise asymptotic formula for the size α̂t(Gn,p) of a largest vertex subset inGn,p that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t = t(n) is not too large. In the case of fixed t and p, we find that this value is asymptotically almost surely concentrated on at most two explicitly given points. ...
متن کاملLargest planar matching in random bipartite graphs
Given a distribution G over labeled bipartite (multi) graphs, G = (W; M; E) where jWj = jMj = n, let L(n) denote the size of the largest planar matching of G (here W and M are posets drawn on the plane as two ordered rows of nodes, an upper and a lower one, and a (w; m) edge is drawn as a straight line between w and m). The main focus of this work is to understand the asymptotic (in n) behavior...
متن کاملBisecting sparse random graphs
Consider partitions of the vertex set of a graph G into two sets with sizes differing by at most 1: the bisection width of G is the minimum over all such partitions of the number of ‘‘cross edges’’ between the parts. We are interested in sparse random graphs Ž . G with edge probability c n. We show that, if c ln 4, then the bisection width is n n, c n with high probability; while if c ln 4, the...
متن کاملSparse Quasi-Random Graphs
Quasi-random graph properties form a large equivalence class of graph properties which are all shared by random graphs. In recent years, various aspects of these properties have been treated by a number of authors (e.g., see [5]-[14], [16], [23]-[27]). Almost all of these results deal with dense graphs, that is, graphs on n vertices having cn edges for some c > 0 as n → ∞. In this paper, we ext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in mathematics
سال: 2021
ISSN: ['2297-024X', '2297-0215']
DOI: https://doi.org/10.1007/978-3-030-83823-2_8